Church-Rosser Made Easy
نویسنده
چکیده
The Church–Rosser theorem states that the λ-calculus is confluent under αand β-reductions. The standard proof of this result is due to Tait and Martin-Löf. In this note, we present an alternative proof based on the notion of acceptable orderings. The technique is easily modified to give confluence of the βη-calculus.
منابع مشابه
An ACCL which is not a CRCL
It is fairly easy to show that every regular set is an almost-confluent congruential language (ACCL), and it is known [3] that every regular set is a Church-Rosser congruential language (CRCL). Whether there exists an ACCL, which is not a CRCL, seems to remain an open question. In this note we present one such ACCL.
متن کاملAn Application of Klop ' s Counterexampleto a Higher
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, which has the Church-Rosser property, to a Church-Rosser rst-order algebraic rewrite system may not be Church-Rosser. In contrast, Breazu-Tannen recently showed that augmenting any Church-Rosser rst-order algebraic rewrite system with the simply-typed lambda calculus results in a Church-Rosser re...
متن کاملAn Application of Klop's Counterexample to a Higher-order Rewrite System
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, which has the Church-Rosser property, to a Church-Rosser rst-order algebraic rewrite system may not be Church-Rosser. In contrast, Breazu-Tannen recently showed that augmenting any Church-Rosser rst-order algebraic rewrite system with the simply-typed lambda calculus results in a Church-Rosser re...
متن کاملChurch-Rosser Groups and Growing Context-Sensitive Groups
A finitely generated group is called a Church-Rosser group (growing contextsensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the ChurchRosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free language...
متن کاملOn Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids
— Let M be an infinité commutative monoid. Suppose that M has a Church-Rosser présentation. If M is cancellative or if the présentation is special then M is either the free cyclic group or the free cyclic monoid. Résumé. — Soit M un monoide commutatif infini. Supposons que M possède une présentation finie ayant la propriété de « Church-Rosser ». Si M est simplifiable ou si la présentation est s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 103 شماره
صفحات -
تاریخ انتشار 2010